Equational unification, word unification, and 2nd-order equational unification
نویسندگان
چکیده
منابع مشابه
Order-sorted Equational Unification Revisited
This paper presents a rule-based algorithm for performing order-sorted E-unification using an unsorted E-unification decision procedure under assumptions about E that are commonly satisfied in practice. We have implemented this algorithm in Maude for use with the Maude-NRL protocol analyzer and have used CiME for unsorted E-unification for E any set of AC and ACU axioms. In many examples of int...
متن کاملUnification and Anti-unification modulo Equational Theories
Automated reasoning modulo an equational theory E is a fundamental technique in many applications. If E can be split as a disjoint union R ∪ Ax in such a way that R is a set of rewrite rules that are confluent, terminating, sort-decreasing, and coherent modulo a set of equational axioms Ax, it is well-known that narrowing with R modulo Ax provides a complete E-unification algorithm. However, na...
متن کاملHigher-Order Equational Pattern Anti-Unification [Preprint]
We consider anti-unification for simply typed lambda terms in associative, commutative, and associativecommutative theories and develop a sound and complete algorithm which takes two lambda terms and computes their generalizations in the form of higher-order patterns. The problem is finitary: the minimal complete set of generalizations contains finitely many elements. We define the notion of op...
متن کاملHigher-Order Equational Unification via Explicit Substitutions
We show how to reduce the uniication problem modulo-conversion and a rst-order equational theory E, into a rst-order uni-cation problem in a union of two non-disjoint equational theories including E and a calculus of explicit substitutions. A rule-based uniica-tion procedure in this combined theory is described and may be viewed as an extension of the one initially designed by G. Dowek, T. Hard...
متن کاملHigher-Order Equational Pattern Anti-Unification∗
We consider anti-unification for simply typed lambda terms in associative, commutative, and associative-commutative theories and develop a sound and complete algorithm which takes two lambda terms and computes their generalizations in the form of higher-order patterns. The problem is finitary: the minimal complete set of generalizations contains finitely many elements. We define the notion of o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1998
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(97)00130-8